Symbol-emblem, Symbol-code and Mythical Connotations
نویسندگان
چکیده
منابع مشابه
A Symbol-based Bar Code Decoding Algorithm
We investigate the problem of decoding bar codes from a signal measured with a hand-held laser-based scanner. Rather than formulating the inverse problem as one of binary image reconstruction, we instead determine the unknown code from the signal. Our approach has the benefit of incorporating the symbology of the bar code, which reduces the degrees of freedom in the problem. We develop a sparse...
متن کاملSymbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملMulticarrier code division multiplex with iterative MAP symbol-by-symbol estimation
In this paper we consider a Multi Carrier Code Division Multiplex (MC–CDM) scheme. At the receiver side the Maximum A Posteriori Symbol–by–Symbol Estimator (MAPSSE) is used for the detection of the CDM signal. Therefore the influence of the spreading factor on the overall Bit Error Rate (BER) is investigated. We concatenate the MAPSSE with the channel decoder which allows for iterative decoding...
متن کاملA Symbol Is Not a Symbol
One of the weak points of the present critics of AI is their lack of an alternative cognitive theory. In the paper the outline of such a theory is sketched, based on (one reading) of Piaget's genetic epistemology. This is used to clarify the ambiguity of the terms 'symbol' and 'representation', thereby making it possible to suggest a reconciliation of the positions of the critics and defenders ...
متن کاملPerformance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding
A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend–Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMC’s). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2014
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2014.01.1092